Denotational semantics of hybrid automata

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Denotational Semantics of Hybrid Automata

A hybrid automaton [16,2] is a digital, real-time system that interacts with an analogue environment. Hybrid automata are ubiquitous in all areas of modern engineering and technology. For example, the (digital) height control of an automobile chassis depends on and influences the (continuous) driving conditions of the vehicle [22]. Hybrid automata typically operate in safety critical areas, suc...

متن کامل

A Hybrid Denotational Semantics for Hybrid Systems

In this article, we present a model and a denotational semantics for hybrid systems. Our model is designed so that it may be easily used for modeling large, existing embedded applications, which is a first step toward their validation. The discrete subsystem is modeled by a program written in an extension of an imperative language and the continuous subsystem is modeled by differential equation...

متن کامل

A Hybrid Denotational Semantics for Hybrid Systems – Extended Version

In this article, we present a model and a denotational semantics for hybrid systems. Our model is designed to be used for the verification of large, existing embedded applications. The discrete part is modeled by a program written in an extension of an imperative language and the continuous part is modeled by differential equations. We give a denotational semantics to the continuous system insp...

متن کامل

Denotational Semantics and Refinement

Denotational descriptions are frequently presented in terms of a sequence of descriptions of programming languages of increasing complexity. We discuss a formal approach to the study of such description sequences in terms of a refinement relation, showing how the informal use made of this approach in tutorial introductions to denotational semantics may be formally justified.

متن کامل

Revisiting Elementary Denotational Semantics

We present a semantics for an applied call-by-value λ-calculus that is compositional, extensional, and elementary. We present four di‚erent views of the semantics: 1) as a relational (big-step) semantics that is not operational but instead declarative, 2) as a denotational semantics that does not use domain theory, 3) as a non-deterministic interpreter, and 4) as a variant of the intersection t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of Logic and Algebraic Programming

سال: 2007

ISSN: 1567-8326

DOI: 10.1016/j.jlap.2007.01.002